Lossless Join Decomposition Avoid Inconsistency in Fuzzy Relational Database for Perfect Operation
نویسنده
چکیده
Fuzzy relational database handle imprecise information on database to maintain integrity of operation. Already I handled different normal form to reduce redundancy of data in a database. Decomposition of a relation should not be arbitrary either by tuples or attributes of a relation. In this paper, I have focused on lossless decomposition of third or Boyce Codd normal form based relation so that I can get back original relation after joining all sub relations. Original relation can not retrieve from decomposed relation if the decomposition is not lossless. So any decomposed relation should follow lossless and dependency preservation for it‘s accurate normalized opration.
منابع مشابه
Fuzzy Join Dependency in Fuzzy Relational Databases
The join dependency provides the basis for obtaining lossless join decomposition in a classical relational schema. The existence of Join dependency shows that that the tables always represent the correct data after being joined. Since the classical relational databases cannot handle imprecise data, they were extended to fuzzy relational databases so that uncertain, ambiguous, imprecise and part...
متن کاملAvoid Inconsistency in Fuzzy Relational Database for Secure Operation
Fuzzy relational database handle uncertain and imprecise information for consistent operation on database and manipulate information. In this paper, I introduced fuzzy normal forms for similarity based fuzzy relational database model. First of all I have focused on fuzzy closure of attribute set which can be utilized to find fuzzy key. Next, with the concepts of α -ffd [1], I have defined fuzzy...
متن کاملEnsuring the Existence of a BCNF-Decomposition that Preserves Functional Dependencies in O(N²) Time
In the design theory for the relational data base model [6] the decomposition of a relation scheme according to some normal form has been advocated for as one means to avoid undesired redundancy and anomalies [7,8,16]. Desired characteristics of such a decomposition in the case of a relation scheme R with an associated set F of functional dependencies are the lossless-join property and the pres...
متن کاملA Framework for Reducing Multidimensional Database to Two Dimensions
This work used a method of Matrix Decomposition Algorithm to obtain a new dataset of genetic epistasis as a surrogate for a multidimensional dataset which transformed multidimensional database to a 2dimensional database. It employed decomposition algorithms based on Boyce Codd Normal Form for minimizing anomalies. The decomposition and reversible algorithms were used on relationship among objec...
متن کاملAn Optimal Skew-insensitive Join and Multi-join Algorithm for Distributed Architectures
The development of scalable parallel database systems requires the design of efficient algorithms for the join operation which is the most frequent and expensive operation in relational database systems. The join is also the most vulnerable operation to data skew and to the high cost of communication in distributed architectures. In this paper, we present a new parallel algorithm for join and m...
متن کامل